Plausibly hard combinatorial tautologies
نویسنده
چکیده
We present a simple propositional proof system which consists of a single axiom schema and a single rule, and use this system to construct a sequence of combinatorial tautologies that, when added to any Frege system, p-simulates extended-Frege systems.
منابع مشابه
Are there Hard Examples for Frege Systems?
It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatorial tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs. Surprisingly, we conclude that no particularly good or convincing examples are known. The examples of ...
متن کاملNondeterministic Instance Complexity and Hard-to-Prove Tautologies
In this note we rst formalize the notion of hard tautologies using a nondeterministic generalization of instance complexity. We then show, under reasonable complexity-theoretic assumptions, that there are innnitely many propositional tautologies that are hard to prove in any sound propositional proof system.
متن کاملThe Strength of Parameterized Tree-like Resolution
We examine the proof-theoretic strength of parameterized tree-like resolution—a proof system for the coW[2]complete set of parameterized tautologies. Parameterized resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider (FOCS’07). In that paper, Dantchev et al. show a complexity gap in parameterized tree-like resolution fo...
متن کاملLower Bounds for Polynomial Calculus: Non-Binomial Case
We generalize recent linear lower bounds for Polynomial Calculus based on binomial ideals. We produce a general hardness criterion (that we call immunity) which is satisfied by a random function and prove linear lower bounds on the size of PC refutations for a wide class of tautologies based on immune functions. As some applications of our techniques, we introduce modp Tseitin tautologies in th...
متن کاملGenerating hard tautologies using predicate logic and the symmetric group
We introduce methods to generate uniform families of hard propositional tautologies. The tautologies are essentially generated from a single propositional formula by a natural action of the symmetric group Sn. The basic idea is that any Second Order Existential sentence Ψ can be systematically translated into a conjunction φ of a finite collection of clauses such that the models of size n of an...
متن کامل